On the Largest Common Subtree of Random Leaf-Labeled Binary Trees
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 22 June 2020Accepted: 29 October 2021Published online: 27 January 2022Keywordsmaximum agreement subtree, random tree, stochastic fragmentationAMS Subject Headings60C05, 05C80Publication DataISSN (print): 0895-4801ISSN (online): 1095-7146Publisher: Society for Industrial and Applied MathematicsCODEN: sjdmec
منابع مشابه
About the largest subtree common to several X-trees
résumé – Etant donnés plusieurs X-arbres, ou arbres phylogénétiques, sur le même ensemble X, nous cherchons à construire un plus grand sous-ensemble Y ⊂ X tel que les arbres partiels induits sur Y soient identiques d’un point de vue topologique, c’est-à-dire indépendemment des longueurs des arêtes. Ce problème, connu sous le nom de MAST (Maximum Agreement SubTree), est NP-Difficile, dans le cas...
متن کاملAbout the Largest Subtree Common to Several Phylogenetic Trees
Given several phylogenetic trees on the same set of taxa X, we look for a largest subset Y in X such that all the partial trees reduced by Y are identical. The problem has polynomial complexity when there are only two trees but it is NP-hard for more than two. We introduce a polynomial approximation algorithm for the multiple case, which is easy to implement, very efficient and which produces a...
متن کاملOn Random Binary Trees
A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and restated as a recursion more useful computationally . A generating function for the number of nodes given height is developed and used to find the a...
متن کاملOn the Maximum Common Embedded Subtree Problem for Ordered Trees
The maximum common embedded subtree problem, which generalizes the minor containment problem on trees, is reduced for ordered trees to a variant of the longest common subsequence problem. While the maximum common embedded subtree problem is known to be APX-hard for unordered trees, an exact solution for ordered trees can be found in polynomial time. In this paper, the longest common balanced se...
متن کاملApproximation Algorithms for the Largest Common Subtree Problem
The largest common subtree problem is to nd a largest tree which occurs as a common subgraph in a given collection of trees. Let n denote the number of vertices in the largest tree in the collection. We show that in the case of bounded degree trees, it is possible to achieve an approximation ratio of O(n(log logn)= log n). For unbounded degree trees, we give an algorithm with approximation rati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2022
ISSN: ['1095-7146', '0895-4801']
DOI: https://doi.org/10.1137/20m1347504